Mostly-Strongly-Timed Programming in LC

نویسندگان

  • Hiroki Nishino
  • Ryohei Nakatsu
چکیده

Due to its synchronous behaviour, a strongly-timed program can suffer from the temporary suspension of realtime DSP in the presence of a time-consuming task. In this paper, we propose mostly-strongly-timed programming, which extends strongly-timed programming with the explicit switch between synchronous context and asynchronous context. If a thread is in asynchronous context, the underlying scheduler is allowed to preempt it without the explicit advance of logical time. Timeconsuming tasks can be executed asynchronously, without causing the temporary suspension of real-time DSP. We also discuss how the concept is integrated in LC, a new computer music programming language we prototyped, together with the discussion on implementation issues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LC: A New Computer Music Programming Language with Three Core Features

This paper gives a brief overview of the three core features of LC, a new computer music programming language we prototyped: (1) prototype-based programming at both levels of compositional algorithms and sound synthesis, (2) the mostly-strongly-timed programming concept and other features with respect to time, and (3) the integration of objects and functions that can directly represent microsou...

متن کامل

Timed Modal Logics for Real-Time Systems - Specification, Verification and Control

In this paper, a timed modal logic Lc is presented for the specification and verification of real-time systems. Several important results for Lc are discussed. First we address the model checking problem and we show that it is an EXPTIMEcomplete problem. Secondly we consider expressiveness and we explain how to express strong timed bisimilarity and how to build characteristic formulas for timed...

متن کامل

Christel Baier , Nathalie Bertrand , Patricia Bouyer and Thomas Brihaye When are Timed Automata Determinizable ? Research Report LSV - 09 - 08 14 April 2009

In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boundedness condition, the infinite timed tree can be reduced into a classical deterministic timed automaton. The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be d...

متن کامل

ChucK: A Strongly Timed Computer Music Language

ChucK is a programming language designed for computer music. It aims to be expressive and straightforward to read and write with respect to time and concurrency, and to provide a platform for precise audio synthesis and analysis and for rapid experimentation in computer music. In particular, ChucK defines the notion of a strongly timed audio programming language, comprising a versatile time-bas...

متن کامل

Role of Orexin-A receptors within the Locus Coeruleus in the antinociception induced by microinjection of carbachol into the lateral hypothalamus

Introduction: Previous studies have shown that stimulation of lateral hypothalamus (LH) produces antinociception. Orexin-A (OXA) receptor is strongly expressed in the nucleus locus coeruleus (LC) and orexinergic fibers densely project from LH to LC. In this study, we assessed the role of LC and its OXA receptors in antinociceptive response induced by LH chemical stimulation in the rat. Meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014